منابع مشابه
Image Compression using Hartley transform
The report presents a novel approach for image compression using the Hartley transform (HT). The Hartley transform has the advantage of solving the problem of phase wrapping from which the Fourier transform suffers. The magnitude and phase compression using this transformation (HT) have proved better performance than those of the Fourier Transform. Magnitude and phase were processed separately....
متن کاملHartley Transform Based Fingerprint Matching
The Hartley transform based feature extraction method is proposed for fingerprint matching. Hartley transform is applied on a smaller region that has been cropped around the core point. The performance of this proposed method is evaluated based on the standard database of Bologna University and the database of the FVC2002. We used the city block distance to compute the similarity between the te...
متن کاملThe Hartley Transform in a Finite Field
In this paper, the k-trigonometric functions over the Galois Field GF(q) are introduced and their main properties derived. This leads to the definition of the cask(.) function over GF(q), which in turn leads to a finite field Hartley Transform . The main properties of this new discrete transform are presented and areas for possible applications are mentioned.
متن کاملMatrix expansions for computing the discrete hartley transform for blocklength N ≡ 0 (mod 4)
Abstract— A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, than Split-Radix algorithm. A detailed descriptio...
متن کاملRadix-2 Fast Hartley Transform Revisited
A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform. Key-words Discrete transforms, Hartley transform, Hadamard Transform.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers in Physics
سال: 1995
ISSN: 0894-1866
DOI: 10.1063/1.168534